CS7032: AI & Agents: Ms Pac-Man vs Ghost League - AI controller project

نویسنده

  • TIMOTHY COSTIGAN
چکیده

This report discusses various approaches to implementing an AI for the Ms Pac-Man vs Ghosts league. It implements a purelyreactive subsumption based agent to control Ms Pac-Man which consists of three modules : evade, hunt and gather which are arranged by priority. The behaviour of the agent can be adjusted by altering its hunt distance and evade distance parameters to determine when to chase, evade or ignore ghosts. The performance of the agent was evaluated across a range of parameter values for 100 trials at each point and its ideal average score was found to be at around : hunt distance = 75 and evade distance = 5. The results of the report suggest that a risk taking strategy is good for a reactive agent although alternative methods such as reinforcement learning or finite state machines may be better.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Cellular Automaton Based Controller for a Ms. Pac-Man Agent

Video games can be used as an excellent test bed for Artificial Intelligence (AI) techniques. They are challenging and non-deterministic, this makes it very difficult to write strong AI players. An example of such a video game is Ms. Pac-Man. In this paper I will outline some of the previous techniques used to build AI controllers for Ms. Pac-Man as well as presenting a new and novel solution. ...

متن کامل

A Model-Based Approach to Optimizing Ms. Pac-Man Game Strategies in Real Time

This paper presents a model-based approach for computing real-time optimal decision strategies in the pursuitevasion game of Ms. Pac-Man. The game of Ms. Pac-Man is an excellent benchmark problem of pursuit-evasion game with multiple, active adversaries that adapt their pursuit policies based on Ms. Pac-Man’s state and decisions. In addition to evading the adversaries, the agent must pursue mul...

متن کامل

Enhancements for Monte-Carlo Tree Search in Ms Pac-Man

In this paper enhancements for the Monte-Carlo Tree Search (MCTS) framework are investigated to play Ms Pac-Man. MCTS is used to find an optimal path for an agent at each turn, determining the move to make based on randomised simulations. Ms Pac-Man is a real-time arcade game, in which the protagonist has several independent goals but no conclusive terminal state. Unlike games such as Chess or ...

متن کامل

Discovering Multimodal Behavior in Ms. Pac-Man Through Evolution of Modular Neural Networks

Ms. Pac-Man is a challenging video game in which multiple modes of behavior are required: Ms. Pac-Man must escape ghosts when they are threats and catch them when they are edible, in addition to eating all pills in each level. Past approaches to learning behavior in Ms. Pac-Man have treated the game as a single task to be learned using monolithic policy representations. In contrast, this paper ...

متن کامل

Teaching Introductory Artificial Intelligence with Pac-Man

The projects that we have developed for UC Berkeley’s introductory artificial intelligence (AI) course teach foundational concepts using the classic video game Pac-Man. There are four project topics: state-space search, multi-agent search, probabilistic inference, and reinforcement learning. Each project requires students to implement general-purpose AI algorithms and then to inject domain know...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013